Energy-Aware Partitioning for Multiprocessor Real-Time Systems
نویسندگان
چکیده
In this paper, we address the problem of partitioning periodic real-time tasks in a multiprocessor platform by considering both feasibility and energy-awareness perspectives: our objective is to compute the feasible partitioning that results in minimum energy consumption on multiple identical processors by using variable voltage Earliest-Deadline-First scheduling. We show that the problem is NP-Hard in the strong sense on m ≥ 2 processors even when feasibility is guaranteed a priori. Then, we develop our framework where load balancing plays a major role in producing energy-efficient partitionings. We evaluate the feasibility and energy-efficiency performances of partitioning heuristics experimentally.
منابع مشابه
Hybrid Scheduling Scheme for Real Time Systems
Systems as asymmetric multiprocessor platforms are considered power-efficient multiprocessor architectures, efficient task partitioning (assignment) and play a crucial role in achieving more energy efficiency at these multiprocessor platforms. This paper addresses the problem of energy-aware static partitioning of periodic real time tasks on heterogeneous multiprocessor platforms. A hybrid appr...
متن کاملLeakage-Aware Energy-Efficient Partitioning for Real-Time Tasks on Multiprocessor Systems
Many embedded real-time systems require to process at high throughput while meeting real-time constraints. To improve performance of systems, multiprocessors have been used widely. Reduction of energy consumption is one of the most important issues in such systems, which operate with limited system resources. From the point of view of real-time scheduling, many approaches which save energy cons...
متن کاملA Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملMultiprocessor Scheduling For Real Time Systems Embedded Systems
energy-ef?cient tasks scheduling algorithm for real-time utility accrual real-time scheduling for multiprocessor multiprocessor real-time scheduling in industrial embedded a novel approach for off-line multiprocessor scheduling in multiprocessor scheduling for real time systems embedded robust partitioned scheduling for realtime multiprocessor multiprocessor scheduling for real time systems emb...
متن کاملPower Efficient Scheduling Scheme based on PSO for Real Time Systems
Power efficient design of real-time embedded systems based on multi-processors becomes more important as system functionality is increasingly realized through heuristic approaches. This paper targets energy-efficient scheduling of tasks over multiple processors, where tasks share a common deadline. It addresses the problem of energy-aware static partitioning of periodic real time tasks on heter...
متن کامل